A Decidable Very Expressive Description Logic for Databases
نویسندگان
چکیده
We introduce DLR ,̀ an extension of the n-ary propositionally closed description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms. We show how a simple syntactic restriction on the appearance of projections sharing common attributes in a DLR` knowledge base makes reasoning in the language decidable with the same computational complexity as DLR. The obtained DLR ̆ nary description logic is able to encode more thoroughly conceptual data models such as EER, UML, and ORM.
منابع مشابه
A Decidable Very Expressive Description Logic for Databases (Extended Version)
We introduce DLR, an extension of the n-ary propositionally closed description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms. We show how a si...
متن کاملOn Role Logic
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of de Bruijn’s notation for lambda calculus, an encoding of first-order logic in lambda calculus, and a simple rule for implicit arguments of unary and binary predicates. The unrestricted version of role logic has the exp...
متن کاملCombining description logics and Horn rules with uncertainty in ARTIGENCE
We present ARTIGENCE, a representation language that combines description logics and Horn rules with uncertainty. ARTIGENCE capabilities go beyond the similar hybrid systems presently available, and it contains three components: a highly expressive description logic ACLNR, a set of probabilistic Horn rules and a set of ground facts. The new features described, often required in realistic applic...
متن کاملStatic Analysis of Semantic Web Queries
Query containment is defined as the problem of determining if the result of a query is included in the result of another query for any given dataset. It has major applications in query optimization and knowledge base verification. The main objective of this thesis is to provide sound and complete procedures to determine containment of SPARQL queries under expressive description logic axioms. Fu...
متن کاملIntegrating Action Calculi and Description Logics
General action languages, like e.g. the Situation Calculus, use full classical logic to represent knowledge of actions and their effects in dynamic domains. Description Logics, on the other hand, have been developed to represent static knowledge with the help of decidable subsets of first order logic. In this paper, we show how to use Description Logic as the basis for a decidable yet still exp...
متن کامل